Two Polynomial Time Graph Labeling Algorithms Optimizing Max-Norm-Based Objective Functions
نویسندگان
چکیده
منابع مشابه
Analysis of Two Algorithms for Multi-objective Min-max Optimization
This paper presents two memetic algorithms to solve multi-objective min-max problems, such as the ones that arise in evidence-based robust optimization. Indeed, the solutions that minimize the design budgets are robust under epistemic uncertainty if they maximize the belief in the realization of the value of the design budgets. Thus robust solutions are found by minimizing with respect to the d...
متن کاملOptimizing Connected Component Labeling Algorithms
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in...
متن کاملPolynomial Time Algorithms for Three-Label Point Labeling
In this paper, we present an time solution for the following multi-label map labeling problem: Given a set of distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundaries of its three labeling squares. We also study the problem under the discrete model, i.e., a site must be at the...
متن کاملDeterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
In this paper we give a deterministic polynomial-time approximation algorithm for computing complex-valued evaluations of the Tutte polynomial and the independence polynomial on bounded degree graphs, as well for computing partition functions of complex-valued spin and edge-coloring models on bounded degree graphs. Our work builds on a recent line of work initiated by Barvinok [2, 3, 4, 5], whi...
متن کاملFaster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances
We show that a random instance of a weighted maximum constraint satisfaction problem (or max 2-csp), whose clauses are over pairs of binary variables, is solvable by a deterministic algorithm in polynomial expected time, in the “sparse” regime where the expected number of clauses is half the number of variables. In particular, a maximum cut in a random graph with edge density 1/n or less can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2020
ISSN: 0924-9907,1573-7683
DOI: 10.1007/s10851-020-00963-8